翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

TRILL (Computer Networking) : ウィキペディア英語版
TRILL (computing)

TRILL ("Transparent Interconnection of Lots of Links") is an IETF Standard implemented by devices called RBridges (routing bridges) or TRILL Switches. TRILL combines techniques from bridging and routing and is the application of link state routing to the VLAN-aware customer-bridging problem. RBridges are compatible with and can incrementally replace previous IEEE 802.1 customer bridges. They are also compatible with IPv4 and IPv6 routers and end nodes. They are invisible to current IP routers and, like routers, RBridges terminate the bridge spanning tree protocol.
==General overview==
TRILL switches (RBridges) run a link state protocol amongst themselves. A link state protocol is one in which connectivity is broadcast to all the RBridges, so that each RBridge knows about all the other RBridges, and the connectivity between them. This gives RBridges enough information to compute pair-wise optimal paths for unicast, and calculate distribution trees for delivery of frames either to destinations whose location is unknown or to multicast or broadcast groups. The link state routing protocol used is IS-IS because:
* it runs directly over Layer 2, so it can be run without configuration (no IP addresses need to be assigned)
* it is easy to extend by defining new TLV (type-length-value) data elements and sub-elements for carrying TRILL information.
To mitigate temporary loop issues, RBridges forward based on a header with a hop count. RBridges also specify the next hop RBridge as the frame destination when forwarding unicast frames across a shared-media link, which avoids spawning additional copies of frames during a temporary loop. A reverse path forwarding check and other checks are performed on multi-destination frames to further control potentially looping traffic.
The first RBridge that a unicast frame encounters in a campus, RB1, encapsulates the received frame with a TRILL header that specifies the last RBridge, RB2, where the frame is decapsulated. RB1 is known as the "ingress RBridge" and RB2 is known as the "egress RBridge". To save room in the TRILL header and simplify forwarding lookups, a dynamic nickname acquisition protocol is run among the RBridges to select two-octet nicknames for RBridges, unique within the campus, which are an abbreviation for the six-octet IS-IS system ID of the RBridge. The two-octet nicknames are used to specify the ingress and egress RBridges in the TRILL header.
The TRILL header consists of six octets: the first two octets include a six bit decrementing hop count, plus flags; the next two octets contain the egress RBridge nickname; the final two octets contain the ingress RBridge nickname. For multi-destination frames, the "egress RBridge nickname" specifies a distribution tree for the frame, where the (nick)named RBridge is the root of the distribution tree. The ingress RBridge selects which distribution tree the frame should travel along.
Even though RBridges are transparent to Layer 3 devices, and all the links interconnected by RBridges appear to Layer 3 devices to be a single link, RBridges act as link routers in the sense that, in the forwarding of a frame by a transit RBridge, the outer Layer 2 header is replaced at each hop with an appropriate Layer 2 header for the next hop, and the hop count is decreased. Despite these modifications of the outer Layer 2 header and the hop count in the TRILL Header, the original encapsulated frame is preserved, including the original frame's VLAN tag.
Multipathing of multi-destination frames through alternative distribution tree roots and ECMP (Equal Cost MultiPath) of unicast frames are supported. Networks with a more mesh-like structure will benefit to a greater extent from the multipathing and optimal paths provided by TRILL than will networks with a more tree-like structure.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「TRILL (computing)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.